Routing algorithms for recursively-defined data centre networks

The server-centric data centre network architecture can accommodate a wide variety of network topologies. Newly proposed topologies in this arena often require several rounds of analysis and experimentation in order that they might achieve their full potential as data centre networks. We propose a family of novel routing algorithms on two well-known data centre networks of this type, (Generalized) DCell and FiConn, using techniques that can be applied more generally to the class of networks we call completely connected recursively-defined networks. In doing so, we develop a classification of all possible routes from server-node to server-node on these networks, called general routes of order t, and find that for certain topologies of interest, our routing algorithms efficiently produce paths that are up to 16% shorter than the best previously known algorithms, and are comparable to shortest paths. In addition to finding shorter paths, we show evidence that our algorithms also have good load-balancing properties

An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar

DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph; hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(k), where k parameterizes the dimension of DPillar (we refer to the number of ports in its switches as n). Our analysis also enables us to calculate the diameter of DPillar exactly. Moreover, our algorithm is trivial to implement, being essentially a conditional clause of numeric tests, and improves significantly upon a routing algorithm earlier employed for DPillar. Furthermore, we provide empirical data in order to demonstrate this improvement. In particular, we empirically show that our routing algorithm improves the average length of paths found, the aggregate bottleneck throughput, and the communication latency. A secondary, yet important, effect of our work is that it emphasises that datacenter networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance

Road Safety in Great Britain: An Exploratory Data Analysis

Great Britain has one of the safest road networks in the world. However, the consequences of any death or serious injury are devastating for loved ones, as well as for those who help the severely injured. This paper aims to analyse Great Britain's road safety situation and show the response measures for areas where the total damage caused by accidents can be significantly and quickly reduced. For the past 30 years, the UK has had a good record in reducing fatalities over the past 30 years, there is still a considerable number of road deaths. The government continues to scale back road deaths empowering responsible road users by identifying and prosecuting the parameters that make the roads less safe. This study represents an exploratory analysis with deep insights which could provide policy makers with invaluable insights into how accidents happen and how they can be mitigated. We use STATS19 data published by the UK government. Since we need more information about locations which is not provided in STATA19, we first expand the features of the dataset using OpenStreetMap and Visual Crossing. This paper also provides a discussion regarding new road safety methods

An efficient shortest path routing algorithm in the data centre network DPillar

DPillar has recently been proposed as a server-centric data centre network and is combinatorially related to the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving a symmetry property of DPillar. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(klog(n))O(klog⁡(n)), where k parameterizes the dimension of DPillar and n the number of ports in its switches. Moreover, our algorithm is trivial to implement, being essentially a conditional clause of numeric tests, and improves significantly upon a routing algorithm earlier employed for DPillar. A secondary and important effect of our work is that it emphasises that data centre networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance

High prevalence of antibodies against polyomavirus WU, polyomavirus KI, and human bocavirus in German blood donors

<p>Abstract</p> <p>Background</p> <p>DNA of the polyomaviruses WU (WUPyV) and KI (KIPyV) and of human bocavirus (HBoV) has been detected with varying frequency in respiratory tract samples of children. However, only little is known about the humoral immune response against these viruses. Our aim was to establish virus-specific serological assays and to determine the prevalence of immunoglobulin G (IgG) against these three viruses in the general population.</p> <p>Methods</p> <p>The capsid proteins VP1 of WUPyV and KIPyV and VP2 of HBoV were cloned into baculovirus vectors and expressed in Sf9 insect cells. IgG antibodies against WUPyV VP1, KIPyV VP1, and HBoV VP2 were determined by immunofluorescence assays in 100 plasma samples of blood donors.</p> <p>Results</p> <p>The median age of the blood donors was 31 years (range 20 - 66 yrs), 52% were male. 89% of the samples were positive for WUPyV IgG (median age 31 yrs, 49.4% male), 67% were positive for KIPyV IgG (median age 32 yrs, 46.3% male), and 76% were positive for HBoV IgG (median age 32 yrs, 51.3% male). For WUPyV and HBoV, there were no significant differences of the seropositivity rates with respect to age groups or gender. For KIPyV, the seropositivity rate increased significantly from 59% in the age group 20 - 29 years to 100% in the age group > 50 years.</p> <p>Conclusions</p> <p>High prevalences of antibodies against WUPyV, KIPyV, and HBoV were found in plasma samples of healthy adults. The results indicate that primary infection with these viruses occurs during childhood or youth. For KIPyV, the seropositivity appears to increase further during adulthood.</p

Seroepidemiology of Human Polyomaviruses

In addition to the previously characterized viruses BK and JC, three new human polyomaviruses (Pys) have been recently identified: KIV, WUV, and Merkel Cell Py (MCV). Using an ELISA employing recombinant VP1 capsid proteins, we have determined the seroprevalence of KIV, WUV, and MCV, along with BKV and JCV, and the monkey viruses SV40 and LPV. Soluble VP1 proteins were used to assess crossreactivity between viruses. We found the seroprevalence (+/− 1%) in healthy adult blood donors (1501) was SV40 (9%), BKV (82%), JCV (39%), LPV (15%), KIV (55%), WUV (69%), MCV strain 350 (25%), and MCV strain 339 (42%). Competition assays detected no sero-crossreactivity between the VP1 proteins of LPV or MCV or between WUV and KIV. There was considerable sero-crossreactivity between SV40 and BKV, and to a lesser extent, between SV40 and JCV VP1 proteins. After correcting for crossreactivity, the SV40 seroprevalence was ∼2%. The seroprevalence in children under 21 years of age (n = 721) for all Pys was similar to that of the adult population, suggesting that primary exposure to these viruses likely occurs in childhood

The stellar transformation: from interconnection networks to datacenter networks

The first dual-port server-centric datacenter network, FiConn, was introduced in 2009 and there are several others now in existence; however, the pool of topologies to choose from remains small. We propose a new generic construction, the stellar transformation, that dramatically increases the size of this pool by facilitating the transformation of well-studied topologies from interconnection networks, along with their networking properties and routing algorithms, into viable dual-port server-centric datacenter network topologies. We demonstrate that under our transformation, numerous interconnection networks yield datacenter network topologies with potentially good, and easily computable, baseline properties. We instantiate our construction so as to apply it to generalized hypercubes and obtain the datacenter networks GQ⋆. Our construction automatically yields routing algorithms for GQ⋆ and we empirically compare GQ⋆ (and its routing algorithms) with the established datacenter networks FiConn and DPillar (and their routing algorithms); this comparison is with respect to network throughput, latency, load balancing, fault-tolerance, and cost to build, and is with regard to all-to-all, many all-to-all, butterfly, random, hot-region, and hot-spot traffic patterns. We find that GQ⋆ outperforms both FiConn and DPillar (sometimes significantly so) and that there is substantial scope for our stellar transformation to yield new dual-port server-centric datacenter networks that are a considerable improvement on existing ones

ARTICLE IN PRESS YJCSS:2263 JID:YJCSS AID:2263 /FLA [m3SC+; v 1.73; Prn:14/08/2007; 8:34] P.1 (1-13) Journal of Computer and System Sciences •• • (••••) •••–•••

www.elsevier.com/locate/jcss Analytic performance comparison of hypercubes and star graphs with implementation constraint